Van Kampen’s Embedding Obstruction Is Incomplete for 2-complexes in R Michael H. Freedman, Vyacheslav Krushkal and Peter Teichner

نویسنده

  • PETER TEICHNER
چکیده

In 1933, anticipating formal cohomology theory, van Kampen [5] gave a slightly rough description of an obstruction o(K) ∈ H Z/2(K ,Z) which vanishes if and only if an n-dimensional simplicial complex K admits a piecewise-linear embedding into R, n ≥ 3. Here K is the deleted product of a complex K. The cohomology in question is the Z/2-equivariant cohomology where Z/2 acts on the space by exchanging the factors of K and acts on the coefficients by multiplication with (−1). Many details were clarified by Shapiro [3] and Wu [6] in the 1950’s. In 1991 Sarkaria [2] showed that for n = 1 this obstruction provides a necessary and sufficient condition in that dimension as well (and is thus identical to Kuratowski’s subgraph condition). Sarkaria recently asked the first named author if it were possible that the vanishing of o(K) might also imply embeddability for n = 2. It is the purpose of this paper to exhibit a simplicial 2-complex K with 14 vertices, 43 1-cells and 69 2-cells for which o(K) is trivial but which does not admit an embedding into R. If one considers relative settings (K, L) ⊂ (D, S) there is an analogous obstruction and a high dimensional theorem analogous to van Kampen’s. But setting n = 2, K = D ⊔D ⊔D and L ⊂ S the Borromean rings gives an elementary (and well known) example where although the obstruction vanishes there is no relative embedding. Our task was to ”unrelativize” this simple example. In section 2 we recall van Kampen’s obstruction (generalized to a relative setting) and give a modern proof that its vanishing implies the existence of a P.L. embedding into R, n ≥ 3. Section 3 describes the example, proves the absence of a P.L. embedding and the vanishing of the obstruction. In section 4 we show that K does not embed, even topologically, into R.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedding Obstructions and 4-dimensional Thickenings of 2-complexes

The vanishing of Van Kampen’s obstruction is known to be necessary and sufficient for embeddability of a simplicial n-complex into R for n 6= 2, and it was recently shown to be incomplete for n = 2. We use algebraic-topological invariants of four-manifolds with boundary to introduce a sequence of higher embedding obstructions for a class of 2-complexes in R.

متن کامل

Subexponential groups in 4–manifold topology

We present a new, more elementary proof of the Freedman–Teichner result that the geometric classification techniques (surgery, s–cobordism, and pseudoisotopy) hold for topological 4–manifolds with groups of subexponential growth. In an appendix Freedman and Teichner give a correction to their original proof, and reformulate the growth estimates in terms of coarse geometry. AMS Classification nu...

متن کامل

2 8 M ay 1 99 7 ALEXANDER DUALITY , GROPES AND LINK HOMOTOPY

We prove a geometric refinement of Alexander duality for certain 2complexes, the so-called gropes, embedded into 4-space. In addition, we give new proofs and extended versions of two lemmas from [2] which are of central importance in the A-B-slice problem, the main open problem in the classification theory of topological 4-manifolds. Our methods are group theoretical, rather than using Massey p...

متن کامل

Hardness of embedding simplicial complexes in Rd

Let EMBEDk→d be the following algorithmic problem: Given a finite simplicial complex K of dimension at most k, does there exist a (piecewise linear) embedding of K into Rd? Known results easily imply polynomiality of EMBEDk→2 (k = 1, 2; the case k = 1, d = 2 is graph planarity) and of EMBEDk→2k for all k ≥ 3. We show that the celebrated result of Novikov on the algorithmic unsolvability of reco...

متن کامل

Geometric complexity of embeddings in ${\mathbb R}^d$

Given a simplicial complex K , we consider several notions of geometric complexity of embeddings of K in a Euclidean space R : thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL embedding). We show that any n-complex with N simplices which topologically embeds in R , n > 2, can be PL embedded in R with refinement complexity O(e 4+ǫ ). Families of s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005